#include <bits/stdc++.h>
using namespace std;

int a[100050];
int b[100050];
map<int,int>m;

int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin>>n;
    int l=1;
    a[0]=INT_MAX;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        m[a[i]]++;

    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
    {
        if(a[i]==a[i-1])
        {
            continue;
        }
        b[l]=a[i];
        l++;
    }
    int ans=n;
    int can=0;
    for(int i=1;i<l;i++)
    {
        //cout<<b[i]<<" "<<m[b[i]]<<endl;
        ans-=min(can,m[b[i]]);
        can-=min(can,m[b[i]]);
        can+=m[b[i]];

    }
    cout<<ans;
    return 0;
}
